//
// Created by 86131 on 2023/12/18.
//
List Merge( List L1, List L2 ){
    if(!L1 &&!L2){return NULL;}
    List p1 = L1->Next;
    List p2 = L2->Next;
    // L1 = L1->Next;
    // L2 = L2->Next;
    List L = (List)malloc(sizeof (List));
    L->Next = NULL;
    List node_temp;
    node_temp = L;
    while(p1 && p2){
        if(p1->Data<p2->Data){node_temp->Next = p1;p1 =p1->Next;node_temp = node_temp->Next; }
        else{
            node_temp->Next = p2;p2 =p2->Next;node_temp = node_temp->Next;
        }
    }
    if(p1){node_temp->Next = p1;}
    if(p2){node_temp->Next = p2;}
    L1->Next = NULL;
    L2->Next = NULL;
    return L;
}